Parallel algorithms for routing in nonblocking networks
نویسندگان
چکیده
منابع مشابه
A Fast Parallel Routing Algorithm for Strictly Nonblocking Switching Networks
A class of strictly nonblocking (SNB) networks can be constructed from vertical stacking of multiple planes of Banyan networks. Fast routing algorithms are needed for finding available connection paths in networks. In this paper, by modeling the switching routing problem in SNB networks as strong edge coloring problem, we propose a simple and fast parallel routing algorithm for routing connecti...
متن کاملDistributed Control Routing Algorithms for Rearrangeably Nonblocking Optical Banyan Networks
Optical banyan networks can be made rearrangeably nonblocking using its multiple copies in unison. Such rearrangeably nonblocking networks are known as vertically stacked optical banyan (VSOB) networks. Centralized control routing algorithm for this rearrangeably nonblocking optical banyan networks has time complexity O(Nlog2N). A distributed control routing algorithm with time complexity O(log...
متن کامل3 Nonblocking Routing Networks
Suppose you have a network with 2N terminals, consisting of N “input” terminals (drawn on the left side) and N ”output” terminals (drawn on the right side). We want to design a network that connects them, in such a way that every permutation can be routed. That is, for any one-to-one function f from the input terminals to the output terminals, we would like there to be a path in the network fro...
متن کاملMatrix-based Nonblocking Routing Algorithm for Beneš Networks
This paper presents a nonblocking routing algorithm for Beneš networks. Such networks are of potential interest in implementing large scale optical cross-connects, but their complex routing algorithm limits their applications. We use a simple approach to determine the routing tags for a conflict free routing. Available methods proposed in the literature use computationally complex solutions to ...
متن کاملApproximation Algorithms for Con guring Hierarchical Nonblocking Communication Networks
A framework is given for specifying nonblocking tra c limits in a connectionoriented communications network. In this framework, connections may be point-topoint or multipoint, and the data rates may vary from one connection to another. The tra c limits may be \ at", or they may also be hierarchical, representing communities of interest within the network that have higher tra c among themselves ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Systems Theory
سال: 1994
ISSN: 0025-5661,1433-0490
DOI: 10.1007/bf01187091